An Improved Decoding Technique for Efficient Huffman Coding
نویسندگان
چکیده
منابع مشابه
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...
متن کاملWeb Page Compression using Huffman Coding Technique
Compression helps in reducing the redundancy in the data representation so as to reduce the storage requirement of it. Compression is an important technique used to improve web retrieval latency Compression is an important technique used to improve web retrieval latency. Plethora of algorithms is available for compressing the data. Some of the algorithms helps in achieving lossless compression ...
متن کاملAn efficient test vector compression scheme using selective Huffman coding
This paper presents a compression/decompression scheme based on selective Huffman coding for reducing the amount of test data that must be stored on a tester and transferred to each core in a system-on-a-chip (SOC) during manufacturing test. The test data bandwidth between the tester and the SOC is a bottleneck that can result in long test times when testing complex SOCs that contain many cores...
متن کاملLevel-compressed Huffman decoding
Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science Applications and Information Technology
سال: 2017
ISSN: 2474-9257
DOI: 10.15226/2474-9257/2/1/00110